The Ramsey numbers for stripes and complete graphs 1
نویسندگان
چکیده
Lorimer, P.J. and W. Solomon, The Ramsey numbers for stripes and complete graphs 1, Discrete Mathematics 104 (1992) 91-97. The Ramsey numbers r(mK,, n,Pz, , n,P,), p > 2, are calculated for d m for each j.
منابع مشابه
Bipartite Ramsey numbers involving stars, stripes and trees
The Ramsey number R(m,n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn. Bipartite Ramsey problems deal with the same questions but the graph explored is the complete bipartite graph instead of the complete graph. We investigate the appearance of simpler monochromatic graphs such as stripes, stars a...
متن کاملSize Multipartite Ramsey Numbers for Small Paths Versus Stripes
For graphs G and H, the size balanced multipartite Ramsey number ) , ( H G m j is defined as the smallest positive integer s such that any arbitrary two red/blue coloring of the graph s j K × forces the appearance of a red G or a blue H . In this paper we find the exact values of the multipartite Ramsey numbers ) , ( 2 3 nK P m j and ) , ( 2 4 nK P m j .
متن کاملThe Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملA Bound for Size Ramsey Numbers of Multi-partite Graphs
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn 22(m−1)n, where c is a positive constant.
متن کاملRamsey Numbers of K M versus (n; K)-graphs and the Local Density of Graphs Not Containing a K M
In this paper generalized Ramsey numbers of complete graphs K m versus the set h; n; ki of (n; k)-graphs are investigated. The value of r(K m ; hn; ki) is given in general for (relative to n) values of k small compared to n using a correlation with Turr an numbers. These generalized Ramsey numbers can be used to determine the local densities of graphs not containing a subgraph K m .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 104 شماره
صفحات -
تاریخ انتشار 1992